Fast Soft Self-Shadowing on Dynamic Height Fields
نویسندگان
چکیده
We present a new, real-time method for rendering soft shadows from large light sources or lighting environments on dynamic height fields. The method first computes a horizon map for a set of azimuthal directions. To reduce sampling, we compute a multi-resolution pyramid on the height field. Coarser pyramid levels are indexed as the distance from caster to receiver increases. For every receiver point and every azimuthal direction, a smooth function of blocking angle in terms of log distance is reconstructed from a height difference sample at each pyramid level. This function’s maximum approximates the horizon angle. We then sum visibility at each receiver point over wedges determined by successive pairs of horizon angles. Each wedge represents a linear transition in blocking angle over its azimuthal extent. It is precomputed in the order-4 spherical harmonic (SH) basis, for a canonical azimuthal origin and fixed extent, resulting in a 2D table. The SH triple product of 16D vectors representing lighting, total visibility, and diffuse reflectance then yields the soft-shadowed result. Two types of light sources are considered; both are distant and low-frequency. Environmental lights require visibility sampling around the complete 360 azimuth, while key lights sample visibility within a partial swath. Restricting the swath concentrates samples where the light comes from (e.g. 3 azimuthal directions vs. 16-32 for a full swath) and obtains sharper shadows. Our GPU implementation handles height fields up to 1024×1024 in real-time. The computation is simple, local, and parallel, with performance independent of geometric content.
منابع مشابه
Scalable Height Field Self-Shadowing
We present a new method suitable for general purpose graphics processing units to render self-shadows on dynamic height fields under dynamic light environments in real-time. Visibility for each point in the height field is determined as the exact horizon for a set of azimuthal directions in time linear in height field size and the number of directions. The surface is shaded using the horizon in...
متن کاملDynamical scaling behavior in two-dimensional ballistic deposition with shadowing.
The dynamical scaling behavior in two-dimensional ballistic deposition with shadowing is studied as a function of the angular distribution of incoming particles and of the underlying lattice structure. Using a dynamical scaling form for the surface box number, results for the scaling of the surface fractal dimension are also presented. Our results indicate that, in addition to the usual self-af...
متن کاملAre passive protostellar disks stable to self-shadowing?
The uniqueness and stability of irradiated flaring passive protostellar disks is investigated in the context of a simplified set of equations for the vertical height H as a function of radius R. It is found that the well-known flaring disk solution with H ∝ R9/7 is not unique. Diverging solutions and asymptotically conical (H ∝ R) solutions are also found. Moreover, using time-dependent linear ...
متن کاملRobust Soft Shadow Mapping with Depth Peeling
Soft shadow mapping is an attractive solution to the problem of realtime soft shadows because it works with any kind of rasterizable geometry (in particular alpha-transparent textures and hair), it does not require any precomputation, and it is simple to implement on the GPU. However, state-of-the-art approaches have several limitations that prevent them from being practical for all scenes. Fir...
متن کاملReal-time Soft Shadows with Shadow Accumulation
This paper presents a physically plausible soft-shadow algorithm that can be executed real-time by current GPUs. The method works with a single shadow map, requires no preor post-processing, and can also handle self shadowing. The main novelty of the method is in the interpretation of the shadow map. A lexel with depth information is considered as the geometric definition of an elementary shado...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Graph. Forum
دوره 27 شماره
صفحات -
تاریخ انتشار 2008